* Step 1: Bounds WORST_CASE(?,O(n^1))
    + Considered Problem:
        - Strict TRS:
            +(*(x,y),*(x,z)) -> *(x,+(y,z))
        - Signature:
            {+/2} / {*/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} and constructors {*}
    + Applied Processor:
        Bounds {initialAutomaton = perSymbol, enrichment = match}
    + Details:
        The problem is match-bounded by 1.
        The enriched problem is compatible with follwoing automaton.
          *_0(1,1) -> 1
          *_1(1,3) -> 2
          *_1(1,3) -> 3
          +_0(1,1) -> 2
          +_1(1,1) -> 3
* Step 2: EmptyProcessor WORST_CASE(?,O(1))
    + Considered Problem:
        - Weak TRS:
            +(*(x,y),*(x,z)) -> *(x,+(y,z))
        - Signature:
            {+/2} / {*/2}
        - Obligation:
            innermost runtime complexity wrt. defined symbols {+} and constructors {*}
    + Applied Processor:
        EmptyProcessor
    + Details:
        The problem is already closed. The intended complexity is O(1).

WORST_CASE(?,O(n^1))